package hacker_rank.feb14;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;

public class MakeAnagram {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String A = br.readLine();
		String B = br.readLine();
		
		Map<Character, Integer> aMap = new HashMap<Character, Integer>();
		for(char c : A.toCharArray()) {
			Integer k = aMap.get(c);
			if(k == null)
				k = 0;
			aMap.put(c, k+1);
		}
		Map<Character, Integer> bMap = new HashMap<Character, Integer>();
		for(char c : B.toCharArray()) {
			Integer k = bMap.get(c);
			if(k == null)
				k = 0;
			bMap.put(c, k+1);
		}
		
		int res = 0;
		
		for(Entry<Character, Integer> e : aMap.entrySet()) {
			if(bMap.containsKey(e.getKey()) == true) {
				res += Math.abs( e.getValue() - bMap.get(e.getKey()));
			} else {
				res += e.getValue();
			}
		}
		for(Entry<Character, Integer> e : bMap.entrySet()) {
			if(aMap.containsKey(e.getKey()) == false) {
				res += e.getValue();
			}
		}
		System.out.println(res);
				
	}

}
